Frame Correspondences in Modal Predicate Logic
نویسنده
چکیده
Understanding modal predicate logic is a continuing challenge, both philosophical and mathematical. In this paper, I study this system in terms of frame correspondences, finding a number of definability results using substitution methods, including new analyses of axioms in intermediate intuitionistic predicate logics. The semantic arguments often have a different flavour from those in propositional modal logic. But eventually, I hit boundaries to first-order definability of frame conditions. I then relate these findings to the known incompleteness theorems for modal predicate logic, and point out some new directions for further research, including the use of strengthened higher-order proof systems for the basic modal language.
منابع مشابه
The Semantics of Modal Predicate Logic I. Counterpart-Frames
We introduce a new semantics for modal predicate logic, with respect to which a rich class of first-order modal logics is complete, namely all normal first-order modal logics that are extensions of free quantified K. This logic is defined by combining positive free logic with equality PFL . = and the propositional modal logic K. We then uniformly construct—for each modal predicate logic L—a can...
متن کاملModal Frame Correspondences Generalized
Taking Löb's Axiom in modal provability logic as a running thread, we discuss some general methods for extending modal frame correspondences, mainly by adding fixedpoint operators to modal languages as well as their correspondence languages. Our suggestions are backed up by some new results – while we also refer to relevant work by earlier authors . But our main aim is advertizing the perspecti...
متن کاملJohan van Benthem Modal Frame Correspondences and Fixed - Points Dedicated to the memory of
Taking Löb’s Axiom in modal provability logic as a running thread, we discuss some general methods for extending modal frame correspondences, mainly by adding fixed-point operators to modal languages as well as their correspondence languages. Our suggestions are backed up by some new results — while we also refer to relevant work by earlier authors. But our main aim is advertizing the perspecti...
متن کاملFirst-Order Modal Logic Theorem Proving and Standard PROLOG
Many attempts have been started to combine logic programming and modal logics. Most of them however, do not use classical PROLOG, but extend the PROLOG idea in order to cope with modal logic formulae directly. These approaches have the disadvantage that for each logic new logic programming systems are to be developed and the knowledge and experience gathered from PROLOG can hardly be utilized. ...
متن کاملMinimal predicates, fixed-points, and definability
Minimal predicates P satisfying a given first-order description (P) occur widely in mathematical logic and computer science. We give an explicit first-order syntax for special first-order 'PIA conditions' (P) which guarantees unique existence of such minimal predicates. Our main technical result is a preservation theorem showing PIA-conditions to be expressively complete for all those first-ord...
متن کامل